Functions operating on positive-definite symmetric matrices
نویسندگان
چکیده
منابع مشابه
DDtBe for Band Symmetric Positive Definite Matrices
We present a new parallel factorization for band symmetric positive definite (s.p.d) matrices and show some of its applications. Let A be a band s.p.d matrix of order n and half bandwidth m. We show how to factor A as A =DDt Be using approximately 4nm2 jp parallel operations where p =21: is the number of processors. Having this factorization, we improve the time to solve Ax = b by a factor of m...
متن کاملDeconvolution Density Estimation on Spaces of Positive Definite Symmetric Matrices
Motivated by applications in microwave engineering and diffusion tensor imaging, we study the problem of deconvolution density estimation on the space of positive definite symmetric matrices. We develop a nonparametric estimator for the density function of a random sample of positive definite matrices. Our estimator is based on the Helgason-Fourier transform and its inversion, the natural tools...
متن کاملEstimation of symmetric positive-definite matrices from imperfect measurements
In a number of contexts relevant to control problems, including estimation of robot dynamics, covariance, and smart structure mass and stiffness matrices, we need to solve an over-determined set of linear equations AX ≈ B with the constraint that the matrix X be symmetric and positive definite. In the classical least squares method the measurements of A are assumed to be free of error, hence, a...
متن کاملSupervised LogEuclidean Metric Learning for Symmetric Positive Definite Matrices
Metric learning has been shown to be highly effective to improve the performance of nearest neighbor classification. In this paper, we address the problem of metric learning for symmetric positive definite (SPD) matrices such as covariance matrices, which arise in many real-world applications. Naively using standard Mahalanobis metric learning methods under the Euclidean geometry for SPD matric...
متن کامل"Compress and eliminate" solver for symmetric positive definite sparse matrices
We propose a new approximate factorization for solving linear systems with symmetric positive definite sparse matrices. In a nutshell the algorithm is to apply hierarchically block Gaussian elimination and additionally compress the fill-in. The systems that have efficient compression of the fill-in mostly arise from discretization of partial differential equations. We show that the resulting fa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1992
ISSN: 0022-247X
DOI: 10.1016/0022-247x(92)90358-k